There are major advantages in a newer version of Grover's quantum algorithmutilizing a general unitary transformation in the search of a single object ina large unsorted database. In this paper, we generalize this algorithm tomultiobject search. We show the techniques to achieve the reduction of theproblem to one on an invariant subspace of dimension just equal to two.
展开▼